Enlargement of Calderbank-Shor-Steane quantum codes

نویسنده

  • Andrew M. Steane
چکیده

It is shown that a classical error correcting code C = [n, k, d] which contains its dual, C⊥ ⊆ C, and which can be enlarged to C ′ = [n, k′ > k + 1, d′], can be converted into a quantum code of parameters [[n, k + k′ − n,min(d, d3d′/2e)]]. This is a generalisation of a previous construction, it enables many new codes of good efficiency to be discovered. Examples based on classical Bose Chaudhuri Hocquenghem (BCH) codes are discussed. keywords Quantum error correction, BCH code, CSS code ∗Department of Physics, University of Oxford, Clarendon Laboratory, Parks Road, Oxford OX1 3PU, England.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimum Distance of Concatenated Conjugate Codes for Cryptography and Quantum Error Correction

A polynomial construction of error-correcting codes for secure and reliable information transmission is presented. The constructed codes are essentially Calderbank-Shor-Steane (CSS) quantum codes, and hence are also useful for quantum error correction. The asymptotic relative minimum distance of these codes is evaluated, and shown to be larger than that of the codes constructed by Chen, Ling, a...

متن کامل

Constacyclic Codes over Group Ring (Zq[v])/G

Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...

متن کامل

New quantum codes from dual-containing cyclic codes over finite rings

Let R = F2m +uF2m + · · ·+u k F2m , where F2m is the finite field with 2 m elements, m is a positive integer, and u is an indeterminate with u = 0. In this paper, we propose the constructions of two new families of quantum codes obtained from dual-containing cyclic codes of odd length over R. A new Gray map over R is defined and a sufficient and necessary condition for the existence of dual-con...

متن کامل

Secure Direct Communication Using Quantum Calderbank-Shor-Steane Codes

The notion of quantum secure direct communication (QSDC) has been introduced recently in quantum cryptography as a replacement for quantum key distribution, in which two communication entities exchange secure classical messages without establishing any shared keys previously. In this paper, a quantum secure direct communication scheme using quantum Calderbank-Shor-Steane (CCS) error correction ...

متن کامل

Simple proof of security of the BB84 quantum key distribution protocol

We prove that the 1984 protocol of Bennett and Brassard (BB84) for quantum key distribution is secure. We first give a key distribution protocol based on entanglement purification, which can be proven secure using methods from Lo and Chau's proof of security for a similar protocol. We then show that the security of this protocol implies the security of BB84. The entanglement purification based ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 45  شماره 

صفحات  -

تاریخ انتشار 1999